搜索资源列表
beibao.doc.tar
- 程序算法，动态规划，背包问题。。。供学习动态规划。-Program algorithm, dynamic programming, knapsack problem. . . For learning dynamic programming.
beibao
- 背包问题的动态规划求解采用一维数组求解 结构体数组-Knapsack problem solved using dynamic programming for solving one-dimensional array of array of structures
BeiBao
- 遗传算法解决背包问题，代码功力深厚。 更个王振的东西。很好-Genetic algorithm to solve knapsack problem, the code profound skill.
beibao--wenti
- 背包问题，百度文库上下载的，代码有点长，你懂得-Knapsack problem, Baidu download library, code a bit long, you know
beibao
- 背包问题的资料，相对比较全了，可以入门学习用。-Knapsack problem of information, relatively wide, and can be started learning to use.
beibao
- 用动态规划的方法解0/1背包问题。用VC6编译运行正确。供参考-Using dynamic programming for solving 0/1 knapsack problem. Compile and run correctly with VC6. Reference
beibao
- 用贪心法解决背包问题：设有不同价值、不同重量的物品n件，求从这n件物品中选取一部分物品的方案， 使选中的物品的总重量不超过指定的限制重量，但选中物品的价值之和最大。-Knapsack problem with a greedy method to solve: with different values, different weights of items n pieces, find items from n items in the select part of the program
beibao
- 用java 实现 动态规划求0-1背包问题两个实例 包括改进后的算法实现-0-1 knapsack problem of the dynamic programming algorithm, 0-1 knapsack different from the knapsack problem
beibao
- 解决简单的背包问题，大学数据结构的实验内容-Solve simple knapsack problem, the University of the data structure of the experimental content
01-beibao
- 动态规划求解01背包 vc6.0-dynamic programming 0/1 knapsack
beibao
- 用c语言编写的背包问题的算法设计，属于控制台编程-Knapsack problem using the c language algorithm design, and a console programming
beibao
- 给定n种物品和一背包。物品i的重量是wi，其价值为vi，背包的容量为C。问应如何选择装入背包的物品，使得装入背包中物品的总价值最大?-Given the n kinds of goods and a backpack. The weight of the items i wi, the value of vi, the knapsack of capacity C Asked how to select the items of the loaded backpack, making the l
beibao
- 背包问题的解决，，实现在最大载重量下利润最大化的问题-The solution of the knapsack problem
beibao
- 背包问题是经典的数学问题，很多问题都可以转化为该问题而解决，希望该程序对你有所帮助。-Knapsack problem
beibao
- 背包问题，也就是我们常见的那个。在很多的专题实验中都会遇到-Knapsack problem, that is, our common one. Will encounter a lot of topics experiment
0-1-beibao-
- 0。1 背包问题，带有输入说明，和程序详细解释-0.1 knapsack problem, with input instructions, and procedures explained in detail
beibao
- 智能控制解决背包问题的文章，程序等，很实用！-Intelligent Control solve the knapsack problem article, the program is very useful!
beibao
- 背包问题，用PSO解背包a=[95 4 60 32 23 72 80 62 65 46] 物品的体积 c=[55 10 47 5 4 50 8 61 85 87] 物品的价值 b=269 背包的重量限制-Knapsack problem, PSO solutions backpack a = [95 4 60 32 23 72 80 62 65 46] the volume of goods c = 55 10 47 5 4 50 8 61 85 87] b = 269 valu
beibao
- 背包问题，从m个物品中选出某几个，在背包的承重范围内使得背包的价值的最大-Knapsack problem, a few selected from the m items, making the value of the backpack in the backpack load-bearing within
beibao
- 实验，背包问题贪心算法。使装入背包的物品的价值最大。-Experiments, the greedy algorithm knapsack problem.